Canonical logic programs
نویسندگان
چکیده
منابع مشابه
Single Rules form Canonical Logic Programs
It has been conjectured [Blair] that every definite clause logic program containing exactly one rule is canonical. This note presents a simple proof
متن کاملCanonical Kripke Models and the Intuitionistic Semantics of Logic Programs
Motivated by the problem of extending stable semantics (SS) and well-founded semantics (WFS) while avoiding their drawbacks, we propose a new simple and intuitive semantics for (normal) logic programs, called canonical Kripke model semantics. Our approach is based on formulating stability in an intuitionistic framework which helps us overcome several drawbacks. As a consequence, every normal pr...
متن کاملCanonical Logic Programs are Succinctly Incomparable with Propositional Formulas
Canonical (logic) programs (CP) refer to normal logic programs augmented with connective not not. In this paper we address the question of whether CP are succinctly incomparable with propositional formulas (PF). Our main result shows that the PARITY problem, which can be polynomially represented in PF but only has exponential representations in CP. In other words, PARITY separates PF from CP. S...
متن کاملDisjunctive Logic Programs versus Normal Logic Programs
This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation from disjunctive logic programs into normal logic programs is proposed and then proved to be sound over infinite structures. The equivalence of expressive power of two kinds of logic programs over arbitrary structures ...
متن کاملUpdates of Logic Programs by Logic Programs
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow default negation not only in rule bodies but also in their heads.We start by introducing the notion of an update P U of a logic program P by another logic program U . Subsequently, we provide a precise semantic character...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1986
ISSN: 0743-1066
DOI: 10.1016/0743-1066(86)90020-8